Distribution of shortest cycle lengths in random networks
نویسندگان
چکیده
منابع مشابه
Reversible Boolean Networks I: Distribution of Cycle Lengths
We consider a class of models describing the dynamics of N Boolean variables, where the time evolution of each depends on the values of K of the other variables. Previous work has considered models with dissipative dynamics. Here we consider time-reversible models, which necessarily have the property that every possible point in the state-space is an element of one and only one cycle. As in the...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
On the distribution of typical shortest-path lengths in connected random geometric graphs
Stationary point processes in R with two different types of points, say H and L, are considered where the points are located on the edge set G of a random geometric graph, which is assumed to be stationary and connected. Examples include the classical Poisson–Voronoi tessellation with bounded and convex cells, aggregate Voronoi tessellations induced by two (or more) independent Poisson processe...
متن کاملLower Bounds of Shortest Vector Lengths in Random NTRU Lattices
Finding the shortest vector of a lattice is one of the most important problems in computational lattice theory. For a random lattice, one can estimate the length of the shortest vector using the Gaussian heuristic. However, no rigorous proof can be provided for some classes of lattices, as the Gaussian heuristic may not hold for them. In this paper, we propose a general method to estimate lower...
متن کاملOn the Distribution of Cycle Lengths
A. Gyarfas COMPUTER AND AUTOMATION INSTITUTE OF THE HUNGARIAN ACADEMY OF SCIENCES BUDAPEST_ HUNGARY J. Koml6s and E. Szemeredi MATHEMATICAL INSTITUTE OF THE HUNGARIAN ACADEMY OF SCIENCES BUDAPEST_ HUNGARY The set of different cycle lengths of a graph G is denoted by C(G). We study how the distribution of C(G) depends on the minimum degree of G. We prove two results indicating that C(G) is dense...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2017
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.96.062307